Scheduling of a Smart Antenna: Capacitated Coloring of Unit Circular-Arc Graphs
نویسندگان
چکیده
We consider scheduling problems that are motivated by an optimization of the transmission schedule of a smart antenna. In these problems we are given a set of messages and a conflict graph that specifies which messages cannot be transmitted concurrently. In our model the conflict graph is a unit circular-arc graph. Two variants of the problem are considered: c-mbl and nu-c-mbl. In c-mbl, the messages have unit demands, whereas in nu-c-mbl demands are arbitrary. We present an optimal algorithm for c-mbl and a 3-approximation algorithm for nu-c-mbl.
منابع مشابه
Integer Decomposition for Polyhedra Defined by Nearly Totally Unimodular Matrices
We call a matrix A nearly totally unimodular if it can be obtained from a totally unimodular matrix à by adding to each row of à an integer multiple of some fixed row a of Ã. For an integer vector b and a nearly totally unimodular matrix A, we denote by PA,b the integer hull of the set {x ∈ R | Ax ≤ b}. We show that PA,b has the integer decomposition property and that we can find a decompositio...
متن کاملApproximation Algorithms for the Max-coloring Problem
Given a graph G = (V,E) and positive integral vertex weights w : V → N, the max-coloring problem seeks to find a proper vertex coloring of G whose color classes C1, C2, . . . , Ck, minimize ∑k i=1 maxv∈Ciw(v). The problem arises in scheduling conflicting jobs in batches and in minimizing buffer size in dedicated memory managers. In this paper we present three approximation algorithms and one in...
متن کاملPolynomial time recognition of unit circular-arc graphs
We present an efficient algorithm for recognizing unit circular-arc (UCA) graphs, based on a characterization theorem for UCA graphs proved by Tucker in the seventies. Given a proper circular-arc (PCA) graph G, the algorithm starts from a PCA model for G, removes all its circle-covering pairs of arcs and determines whether G is a UCA graph. We also give an O(N) time bound for Tucker’s 3/2-appro...
متن کاملOn k-Coloring of Weighted Circular-Arc Graphs
The problem of coloring a subgraph of any weighted circular-arc graph with a set of k colors is studied in this paper. In such a coloring, two overlapping arcs must receive different colors. Our main result is to derive a 2-approximation algorithm for the NP-hard problem of finding a maximum total weight k-colorable subgraph of any weighted circular-arc graph, and this algorithm runs in O(mloge...
متن کاملHadwiger's conjecture for proper circular arc graphs
Circular arc graphs are graphs whose vertices can be represented as arcs on a circle such that any two vertices are adjacent if and only if their corresponding arcs intersect. Proper circular arc graphs are graphs which have a circular arc representation where no arc is completely contained in any other arc. Hadwiger’s conjecture states that if a graph G has chromatic number k, then a complete ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2006